Using Sat for Attribute Exploration of Formal Context with Constraint
نویسنده
چکیده
This paper presents a formulation of formal context satisfying some constraints which we already know, and an encoding a constraint-implying problem into SAT problem. The constraint-implying problem is whether an attribute implication which holds in the formal context is implied by the other attribute implications which also hold in the formal context together with information of the constraints. This problem occurs in attribute exploration of formal context.
منابع مشابه
Attribute Exploration of Many-Valued Context with SAT
This paper proposes an encoding a background-implying problem in attribute exploration of manyvalued context into a SAT problem. A background-implying problem is whether an attribute implication is implied by some other attribute implications and is also compatible with background knowledge. In the case of manyvalued context, the background knowledge will be its scales which are also formal con...
متن کاملNextClosures with Constraints
In a former paper, the algorithm NextClosures for computing the set of all formal concepts as well as the canonical base for a given formal context has been introduced. Here, this algorithm shall be generalized to a setting where the data-set is described by means of a closure operator in a complete lattice, and furthermore it shall be extended with the possibility to handle constraints that ar...
متن کاملEvaluation of SAT like Proof Techniques for Formal Verification of Word Level Circuits
Word level information on the Register Transfer Level (RTL) offers information for efficient guidance of the proof process in formal verification. Therefore several proof techniques with integrated word level support from other research fields can be applied for formal verification of circuit designs as well. The focus of this work is to evaluate the proof techniques Boolean Satisfiability (SAT...
متن کاملAttribute Exploration with Background Implications and Exceptions
Implications between attributes can represent knowledge about objects in a speciied context. This knowledge representation is especially useful when it is not possible to list all speciied objects. Attribute exploration is a tool of formal concept analysis that supports the acquisition of this knowledge. For a speciied context this interactive procedure determines a minimal list of valid implic...
متن کاملParallel Attribute Exploration
The canonical base of a formal context is a minimal set of implications that is sound and complete. A recent paper has provided a new algorithm for the parallel computation of canonical bases. An important extension is the integration of expert interaction for Attribute Exploration in order to explore implicational bases of inaccessible formal contexts. This paper presents and analyzes an algor...
متن کامل